Througput Upper Bounds for Markovian Petri Nets: Embedded Subnets and Queueing Networks
نویسندگان
چکیده
This paper addresses the computation of upper bounds for the steady-state throughput of stochas-tic Petri nets with immediate and exponentially distributed service times of transitions. We try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing network theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering the slowest embedded subnet (generated by the support of left annullers of the incidence matrix of the net). The obtained results for the case of live and bounded free choice nets are of special interest. For such nets, the subnets generated by the left annullers of the incidence matrix can be seen as embedded product-form closed monoclass queueing networks, and eecient algorithms exist for their analysis.
منابع مشابه
Througput Lower Bounds for Markovian Petri Nets: Transformation Techniques
This paper addresses the computation of lower bounds for the steady-state throughput of stochas-tic Petri nets with immediate and exponentially distributed service times of transitions. We try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing networks theories. Previous results for general service time distributions are improved for the case of Markovian nets by con...
متن کاملEmbedded Product-Form Queueing Networks and the Improvement of Performance Bounds for Petri Net Systems
This paper addresses the computation of upper bounds for the steady-state throughput of stochastic Petri net systems with immediate and generally distributed timed transitions. It is achieved through the use of a kind of decomposition of the whole net system. Results are obtained deeply bridging stochastic Petri net theory to untimed Petri net and queueing network theories. Previous results are...
متن کاملMQNA - Markovian Queueing Networks Analyser
This paper describes the MQNA Markovian Queueing Networks Analyser, a software tool to model and obtain the stationary solution of a large class of Queueing Networks. MQNA can directly solve open and closed product-form queueing networks using classical algorithms. For finite capacity queueing models, MQNA generates Markovian description in the Stochastic Automata Networks (SAN) and Stochastic ...
متن کاملGeneralized Stochastic Petri Nets in Performance Evaluation for Queueing Networks
Markovian queueing networks may be modeled by generalized stochastic Petri nets. The simulation of a model in a properly chosen simulator provides information on the performances of the actual system, mainly in case that the analytical study is intricate. After presenting some general notions on queueing networks and on generalized stochastic Petri nets, this paper points out the PN Toolbox for...
متن کاملSteady-State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes
Totally open systems of Markovian sequential processes are deened as a subclass of stochastic Petri nets. They can be viewed as a generalization of a subclass of queueing networks in which complex sequential servers can be synchronized according to some particular schemes. Structural analysis of these nets is considered for avoiding the state explotion problem of the embedded Markov chain. Some...
متن کامل